Designing and reporting on computational experiments with heuristic methods

نویسندگان

  • Richard S. Barr
  • Bruce L. Golden
  • James P. Kelly
  • Mauricio G. C. Resende
  • William R. Stewart
چکیده

This report discusses the design of computational experiments to test heuristic methods and provides reporting guidelines for such experimentation. The goal is to promote thoughtful, well-planned, and extensive testing of heuristics, full disclosure of experimental conditions, and integrity in and reproducibility of the reported results. Departmentof Computer Science andEngineering, SouthernMethodistUniversity,Dallas, TX 75275-0122, email: [email protected], phone: (214) 768-2605, fax: (214) 768-3085 College of Business and Management, University of Maryland, College Park, MD 20742, email: [email protected] College of Business and Administration, University of Colorado at Boulder, Boulder, CO 80309, email: [email protected] Mathematical SciencesResearch Center, AT&T Bell Laboratories,Murray Hill, NJ 079742040, email: [email protected] School of Business Administration, The College of William and Mary, Williamsburg, VA 23185, email: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guidelines for Designing and Reporting on Computational Experiments with Heuristic Methods

This report studies the design of computational experiments to test heuristic methods and provides guidelines for reporting on such experimentation.... ∗Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX 75275, [email protected] †College of Business, University of Maryland, College Park, MD, [email protected] ‡School of Business, University of Colorad...

متن کامل

Reliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm

We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...

متن کامل

Role of Heuristic Methods with variable Lengths In ANFIS Networks Optimum Design and Training

ANFIS systems have been much considered due to their acceptable performance in terms of creation of fuzzy classifier and training. One main challenge in designing an ANFIS system is to achieve an efficient method with high accuracy and appropriate interpreting capability. Undoubtedly, type and location of membership functions and the way an ANFIS network is trained are of considerable effect on...

متن کامل

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

Heuristic and exact algorithms for Generalized Bin Covering Problem

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Heuristics

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1995